Offloading AI for peer-to-peer games with dead reckoning
نویسندگان
چکیده
In this paper, we study the performance of an offloaded AI agent with increasing network latencies and demonstrate that dead reckoning is effective in mitigating the observed degradation. Dead reckoning refers to a class of algorithms typically employed to predict the state of objects in existing games to mitigate the effects of game lag and improve player experience. For a deployed realtime tank game, we found that increasing latencies will cause gradual degradation to the performance of an AI agent and the performance is severely degraded when latencies reach about 300 ms. We show that a simple implementation of dead reckoning is able to delay the onset of performance degradation for round-trip latencies up to 250 ms and is relatively robust to network jitter and packet loss. Since the observed average latency within the continental North America is approximately 55 ms and inter-continental latencies are in the vicinity of 250 ms, our results demonstrate that it is feasible to offload AI to client machines. Most importantly, our method is practical because it does not require much additional code and it allows offloaded AI agents to be developed in a network-oblivious manner similar to what is presently done for server-based AI.
منابع مشابه
A Physics-Aware Dead Reckoning Technique for Entity State Updates in Distributed Interactive Applications
This paper proposes a novel entity state update technique for physics-rich environments in peer-to-peer Distributed Interactive Applications. The proposed technique consists of a dynamic authority scheme for shared objects and a physics-aware dead reckoning model with an adaptive error threshold. The former is employed to place a bound on the overall inconsistency present in shared objects, whi...
متن کاملThe Florida State University College of Arts and Sciences Accuracy and Fairness in Dead Reckoning Based Distributed Multiplayer Games
Distributed real-time multiplayer games are played over a network among a set of players competing against each other and/or against Artificial Intelligence (AI). A latency hiding and bandwidth reduction technique known as ‘Dead Reckoning’ [6] and [24] is often used in these games. The games use dead reckoning vectors to inform other (at a distance) participating players about the movement of a...
متن کاملScaling Peer-to-Peer Games in Low-Bandwidth Environments
In peer-to-peer multiplayer games, each peer must send periodic updates of its objects to other peers. Since typical broadband users have little upload bandwidth, updates to each player will be infrequent when there are many players in the game. This leads to choppy and unsatisfying gameplay. Therefore, we propose three techniques to compensate for low upload bandwidth in peer-to-peer games: fo...
متن کاملDead Reckoning Using Play Patterns in a Simple 2D Multiplayer Online Game
In today’s gaming world, a player expects the same play experience whether playing on a local network or online with many geographically distant players on congested networks. Because of delay and loss, there may be discrepancies in the simulated environment from player to player, likely resulting in incorrect perception of events. It is desirable to develop methods that minimize this problem. ...
متن کاملComputation Peer Offloading for Energy-Constrained Mobile Edge Computing in Small-Cell Networks
The (ultra-)dense deployment of small-cell base stations (SBSs) endowed with cloud-like computing functionalities paves the way for pervasive mobile edge computing (MEC), enabling ultra-low latency and location-awareness for a variety of emerging mobile applications and the Internet of Things. To handle spatially uneven computation workloads in the network, cooperation among SBSs via workload p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009